Weak Convergence of a Sequence of Quickest Detection Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quickest Detection Problems for Bessel Processes

Consider the motion of a Brownian particle that initially takes place in a twodimensional plane and then after some random/unobservable time continues in the three-dimensional space. Given that only the distance of the particle to the origin is being observed, the problem is to detect the time at which the particle departs from the plane as accurately as possible. We solve this problem in the m...

متن کامل

a comparison of linguistic and pragmatic knowledge: a case of iranian learners of english

در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...

15 صفحه اول

Quickest Cluster Flow Problems

Macroscopic models based on dynamic network flow theory are successfully applied to obtain lower bounds on real evacuation times [1]. The goal of our research is to tighten this lower bound and to make this macroscopic approach more realistic by taking into account clustering of evacuees a sociological phenomenon observed in evacuation scenarios. A cluster of flow units in the network flow mode...

متن کامل

Data-Efficient Quickest Outlying Sequence Detection in Sensor Networks

A sensor network is considered where at each sensor a sequence of random variables is observed. At each time step, a processed version of the observations is transmitted from the sensors to a common node called the fusion center. At some unknown point in time the distribution of observations at an unknown subset of the sensor nodes changes. The objective is to detect the outlying sequences as q...

متن کامل

Multidecision Quickest Change-Point Detection: Previous Achievements and Open Problems

The following multidecision quickest detection problem, which is of importance for a variety of applications, is considered. There are N populations that are either statistically identical or where the change occurs in one of them at an unknown point in time. Alternatively, there may be N “isolated” points/hypotheses associated with a change. It is necessary to detect the change in distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1968

ISSN: 0003-4851

DOI: 10.1214/aoms/1177698048